Regular Synthesis and Sufficiency Conditions for Optimality
نویسندگان
چکیده
We propose a deenition of \regular synthesis," more general than those suggested by other authors such as Boltyanskii and Brunovsk y, and an even more general notion of \regular presynthesis." We give a complete proof of the corresponding suuciency theorem, a slightly weaker version of which had been stated in an earlier article, with only a rough outline of the proof. We illustrate the strength of our result by showing that the optimal synthesis for the famous Fuller problem satisses our hypotheses. We also compare our concept of synthesis with the simpler notion of a \family of solutions of the closed-loop equation arising from an optimal feedback law," and show by means of examples why the latter is inadequate, and why the diiculty cannot be resolved by using other concepts of solution|such as Filippov solutions, or the limits of sample-and-hold solutions recently proposed as feedback solutions by Clarke, Ledyaev, Subbotin and Sontag|for equations with a non-Lipschitz and possibly discontinuous right-hand side.
منابع مشابه
On Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملSufficiency and duality for a nonsmooth vector optimization problem with generalized $alpha$-$d_{I}$-type-I univexity over cones
In this paper, using Clarke’s generalized directional derivative and dI-invexity we introduce new concepts of nonsmooth K-α-dI-invex and generalized type I univex functions over cones for a nonsmooth vector optimization problem with cone constraints. We obtain some sufficient optimality conditions and Mond-Weir type duality results under the foresaid generalized invexity and type I cone-univexi...
متن کاملOptimum testing of multiple hypotheses in quantum detection theory
Strengthening a result of Yuen-Kennedy-Lax and Holevo (YKLH), we relax the (redundant) standard conditions for optimality of minimum-error quantum measurements while retaining sufficiency. This result is made robust by giving quantitative bounds on non-optimality when the simplified conditions fail to hold. These conditions serendipitously appeared as an intermediate step in Barnett and Croke’s...
متن کاملOptimality Conditions and Duality in Multiobjective Programming with Invexity*
( , ) ρ Φ − invexity has recently been introduced with the intent of generalizing invex functions in mathematical programming. Using such conditions we obtain new sufficiency results for optimality in multiobjective programming and extend some classical duality properties.
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Control and Optimization
دوره 39 شماره
صفحات -
تاریخ انتشار 2000